Examination of shape complementarity in docking of unbound proteins.
نویسندگان
چکیده
Here we carry out an examination of shape complementarity as a criterion in protein-protein docking and binding. Specifically, we examine the quality of shape complementarity as a critical determinant not only in the docking of 26 protein-protein "bound" complexed cases, but in particular, of 19 "unbound" protein-protein cases, where the structures have been determined separately. In all cases, entire molecular surfaces are utilized in the docking, with no consideration of the location of the active site, or of particular residues/atoms in either the receptor or the ligand that participate in the binding. To evaluate the goodness of the strictly geometry-based shape complementarity in the docking process as compared to the main favorable and unfavorable energy components, we study systematically a potential correlation between each of these components and the root mean square deviation (RMSD) of the "unbound" protein-protein cases. Specifically, we examine the non-polar buried surface area, polar buried surface area, buried surface area relating to groups bearing unsatisfied buried charges, and the number of hydrogen bonds in all docked protein-protein interfaces. For these cases, where the two proteins have been crystallized separately, and where entire molecular surfaces are considered without a predefinition of the binding site, no correlation is observed. None of these parameters appears to consistently improve on shape complementarity in the docking of unbound molecules. These findings argue that simplicity in the docking process, utilizing geometrical shape criteria may capture many of the essential features in protein-protein docking. In particular, they further reinforce the long held notion of the importance of molecular surface shape complementarity in the binding, and hence in docking. This is particularly interesting in light of the fact that the structures of the docked pairs have been determined separately, allowing side chains on the surface of the proteins to move relatively freely. This study has been enabled by our efficient, computer vision-based docking algorithms. The fast CPU matching times, on the order of minutes on a PC, allow such large-scale docking experiments of large molecules, which may not be feasible by other techniques. Proteins 1999;36:307-317.
منابع مشابه
Examination of Shape
Here we carry out an examination of shape complementarity as a criterion in protein{protein docking and binding. Speci cally, we examine the quality of shape complementarity as a critical determinant not only in the docking of 26 protein{protein \bound", complexed cases, but in particular, of 19 \unbound" protein{protein cases, where the structures have been determined separately. In all cases,...
متن کاملA Novel Protein Soft Docking Algorithm Based on Spectral Analysis of Shape Complementarity
We describe a novel method for predicting protein docking conformations using spectral analysis techniques. Rigid-body docking methods based on shape complementarity, particularly Fourier transform based techniques are successful for docking monomers with conformations adopted at binding (complexed conformations) [4]. This approach is very efficient because a complete search over all six degree...
متن کاملTaking geometry to its edge: fast unbound rigid (and hinge-bent) docking.
We present a very efficient rigid "unbound" soft docking methodology, which is based on detection of geometric shape complementarity, allowing liberal steric clash at the interface. The method is based on local shape feature matching, avoiding the exhaustive search of the 6D transformation space. Our experiments at CAPRI rounds 1 and 2 show that although the method does not perform an exhaustiv...
متن کاملESCHER: a new docking procedure applied to the reconstruction of protein tertiary structure.
Evaluation of Surface Complementarity, Hydrogen bonding, and Electrostatic interaction in molecular Recognition (ESCHER) is a new docking procedure consisting of three modules that work in series. The first module evaluates the geometric complementarity and produces a set of rough solutions for the docking problem. The second module identifies molecular collisions within those solutions, and th...
متن کاملAutomated docking of peptides and proteins by using a genetic algorithm combined with a tabu search.
A genetic algorithm (GA) combined with a tabu search (TA) has been applied as a minimization method to rake the appropriate associated sites for some biomolecular systems. In our docking procedure, surface complementarity and energetic complementarity of a ligand with its receptor have been considered separately in a two-stage docking method. The first stage was to find a set of potential assoc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Proteins
دوره 36 3 شماره
صفحات -
تاریخ انتشار 1999